A projected gradient algorithm for color image decomposition Un algorithme de gradient projeté pour la décomposition d’images en couleurs
نویسندگان
چکیده
In this paper, we are interested in color image processing, and in particular color image decomposition. The problem of image decomposition consists in splitting an original image f into two components u and v. u should contain the geometric information of the original image, while v should be made of the oscillating patterns of f , such as textures. We propose here a scheme based on a projected gradient algorithm to compute the solution of various decomposition models for color images or vector-valued images. We provide a direct convergence proof of the scheme, and we give some analysis on color texture modeling. Key-words: Color image decomposition, projected gradient algorithm, color texture modeling.
منابع مشابه
OSERENA, an Optimized Coloring Algorithm for Dense or Large Scale Wireless Networks
The goal of this research report is to present OSERENA "Optimized SchEduling RoutEr Node Activity", a distributed coloring algorithm optimized for dense wireless networks. Network density has an extremely reduced impact on the size of the messages exchanged to color the network. Furthermore, the number of colors used to color the network is not impacted by this optimization. We describe in this...
متن کاملApplication of the topological gradient method to color image restoration and classification
The goal of this note is to generalize the topological gradient method, applied to restoration and classification problems for grey-level images, to color images. We illustrate our approach with numerical tests. Résumé Application de la méthode du gradient topologique au traitement d’images couleur. Le but de cette note est de généraliser l’approche du gradient topologique, appliquée au problèm...
متن کاملWavelet Expansion and High-order Regularization for Multiscale Fluid-motion Estimation
We consider a novel optic flow estimation algorithm based on a wavelet expansion of the velocity field. In particular, we propose an efficient gradient-based estimation algorithm which naturally encompasses the estimation process into a multiresolution framework while avoiding most of the drawbacks common to this kind of hierarchical methods. We then emphasize that the proposed methodology is w...
متن کاملSystèmes de Liénard et décomposition potentielle-Hamiltonienne I - Méthodologie Liénard systems and potential-Hamiltonian decomposition I - Methodology
Following the Hodge decomposition of regular vector fields we can decompose the second member of any Liénard system into 2 (non unique) polynomials, first corresponding to potential and second to Hamiltonian dynamics. This polynomial Hodge decomposition is called potential-Hamiltonian, denoted PH-decomposition, and we give it for any polynomial differential system of dimension 2. We will give i...
متن کاملJoint Routing and STDMA-based Scheduling to Minimize Delays in Grid Wireless Sensor Networks
In this report, we study the issue of delay optimization and energy efficiency in grid wireless sensor networks (WSNs). We focus on STDMA scheduling, where a predefined cycle is repeated, and where each node has fixed transmission opportunities during specific slots (defined by colors). We assume a STDMA algorithm that takes advantage of the regularity of grid topology to also provide a spatial...
متن کامل